Papers with matching loss

1 papers
Wasserstein Distance Regularized Sequence Representation for Text Matching in Asymmetrical Domains (2020.emnlp-main)

Copied to clipboard

Challenge: Asymmetrical text matching is a fundamental problem in information retrieval and natural language processing.
Approach: They propose a method that regularizes features vectors projected from different domains . WD-Match can be used to improve different text matching methods .
Outcome: The proposed method outperforms existing methods and benchmarks on four datasets.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations